README.md

461. Hamming Distance

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

Given two integers x and y, calculate the Hamming distance.

Note: 0 ≤ x, y < 2³¹.

Example 1:

Input: x = 1, y = 4 Output: 2 Explanation: 1 (0 0 0 1) 4 (0 1 0 0) ↑ ↑ The above arrows point to positions where the corresponding bits are different. 

Solutions (Rust)

1. XOR

implSolution{pubfnhamming_distance(x:i32,y:i32) -> i32{letmut counter = 0;letmut z = x ^ y;while z != 0{ counter += z &1; z >>= 1;} counter }}